Binary amiable Words
نویسنده
چکیده
1 This paper is dedicated to my colleague and friend Alexandru Mateescu, the first author of Parikh matrix mapping.
منابع مشابه
Parikh matrices and amiable words
Using the fact that the Parikh matrix mapping is not an injective mapping, the paper investigates some properties of the set of words with the same Parikh matrix; these words are called “amiable”. The presented results extend the results obtained in [1] for the binary case. In particular it is shown that all the words having the same Parikh matrix can be obtained one from another by applying on...
متن کاملParikh Matrices, Amiability and Istrail Morphism
Using the fact that the Parikh matrix mapping is not an injective mapping, the paper investigates some properties of the set of words having the same Parikh matrix; these words are called “amiable” or “M equivalent”. The presented paper uses the results obtained in [3] for the binary case. The aim is to distinguish the amiable words by using a morphism that provides additional information about...
متن کاملExtending Parikh q-matrices
1. A. Atanasiu. Binary amiable words. International Journal of Foundations of Computer Science, 18(2):387–400, 2007. 2. A. Atanasiu, R. Atanasiu, and I. Petre. Parikh matrices and amiable words. Theoretical Computer Science, 390:102–109, 2008. 3. A. Atanasiu, C. Martin-Vide, and A. Mateescu. On the injectivity of the parikh matrix mapping. Fundamenta Informatica, 46:1–11, 2001. 4. S. Bera and K...
متن کاملGeneralizations of Parikh mappings
Parikh matrices have become a useful tool for investigation of subword structure of words. Several generalizations of this concept have been considered. Based on the concept of formal power series, we describe a general framework covering most of these generalizations. In addition, we provide a new characterization of binary amiable words – words having a common Parikh matrix. Mathematics Subje...
متن کاملA Characterization of Adequate Semigroups by Forbidden Subsemigroups
A semigroup is amiable if there is exactly one idempotent in each R⇤-class and in each L⇤-class. A semigroup is adequate if it is amiable and if its idempotents commute. We characterize adequate semigroups by showing that they are precisely those amiable semigroups which do not contain isomorphic copies of two particular nonadequate semigroups as subsemigroups.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Int. J. Found. Comput. Sci.
دوره 18 شماره
صفحات -
تاریخ انتشار 2007